Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs

نویسندگان

چکیده

A binary Steinhaus triangle is a of zeroes and ones that points down with the same local rule as Pascal modulo 2. said to be rotationally symmetric, horizontally symmetric or dihedrally if it invariant under 120 degrees rotation, horizontal reflection both, respectively. The first part this paper devoted study linear subspaces triangles. We obtain simple explicit bases for each them by using elementary properties binomial coefficients. graph an adjacency matrix whose upper-triangular triangle. even odd all its vertex are odd, One main results existence isomorphism between subspace graphs certain This permits us give, in second paper, basis vector space parity-regular graphs; i.e., odd. Finally, last we consider generalized triangles, triangles ones, point up now, always New deduced from part.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parity-regular Steinhaus graphs

Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n−1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic binary sequences 110...110 of any length n − 1 = 3m. By an exhaustive search the conjecture was known to hold up to 25 vertices. We report h...

متن کامل

Rotational and dihedral symmetries in Steinhaus and Pascal binary triangles

We give explicit formulae for obtaining the binary sequences which produce Steinhaus triangles and generalized Pascal triangles with rotational and dihedral symmetries.

متن کامل

Extreme Weights in Steinhaus Triangles

Let {0 = w0 < w1 < w2 < . . . < wm} be the set of weights of binary Steinhaus triangles of size n, and let Wi be the set of sequences in F n 2 that generate triangles of weight wi. In this paper we obtain the values of wi and the corresponding sets Wi for i ∈ {2, 3,m}, and partial results for i = m− 1.

متن کامل

Regular Steinhaus graphs of odd degree

A Steinhaus matrix is a binary square matrix of size n which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy ai,j = ai−1,j−1+ai−1,j for all 2 6 i < j 6 n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states...

متن کامل

Generalized steinhaus graphs

A generalized Steinhaus graph of order n and type s is a graph with n vertices whose adjacency matrix (a i;j) satisses the relation a i;j =

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2022

ISSN: ['0097-3165', '1096-0899']

DOI: https://doi.org/10.1016/j.jcta.2021.105561